A new theorem on the prime-counting function

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Means of the Values of Prime Counting Function

In this paper, we investigate the means of the values of prime counting function $pi(x)$. First, we compute the arithmetic, the geometric, and the harmonic means of the values of this function, and then we study the limit value of the ratio of them.

متن کامل

ON A SUM INVOLVING THE PRIME COUNTING FUNCTION π(x)

An asymptotic formula for the sum of reciprocals of π(n) is derived, where π(x) is the number of primes not exceeding x. This result improves the previous results of De Koninck-Ivi´c and L. Panaitopol. Let, as usual, π(x) = px 1 denote the number of primes not exceeding x. The prime number theorem (see e.g., [2, Chapter 12]) in its strongest known form states that (1) π(x) = li x + R(x), with (...

متن کامل

Prime Number Theorem for Algebraic Function Fields

Elementary proofs of the abstract prime number theorem of the form A(w) = qm + 0(qmm~i) for algebraic function fields are given. The proofs use a refinement of a tauberian theorem of Bombieri. 0. Introduction The main purpose of this paper is to give elementary proofs of the abstract prime number theorem for algebraic function fields (henceforth, the P.N.T.) which was established in the author'...

متن کامل

The prime-counting function and its analytic approximations

The paper describes a systematic computational study of the prime counting function π(x) and three of its analytic approximations: the logarithmic integral li(x) := ∫ x 0 dt log t , li(x)− 2 li( √ x), and R(x) := ∞k=1 μ(k)li(x1/k)/k, where μ is the Möbius function. The results show that π(x) < li(x) for 2 ≤ x ≤ 1014, and also seem to support several conjectures on the maximal and average errors...

متن کامل

The fractal nature of an approximate prime counting function

Prime number related fractal polygons and curves are derived by combining two different aspects. One is an approximation of the prime counting function build on an additive function. The other are prime number indexed basis entities taken from the discrete or continuous Fourier basis.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Ramanujan Journal

سال: 2015

ISSN: 1382-4090,1572-9303

DOI: 10.1007/s11139-015-9702-z